Gossip Latin Square and The Meet-All Gossipers Problem
نویسندگان
چکیده
Given a network of n = 2 gossipers, we want to schedule a cyclic calendar of meetings between all of them, such that: (1) each gossiper communicates (gossips) only once a day, with one other gossiper, (2) in every (n−1) consecutive days, each gossiper meets all other gossipers, and (3) every gossip, initiated by any gossiper, will reach all gossipers within k = log(n) days. In this paper we study the above stated meet-all gossipers problem, by defining and constructing the Gossip Latin Square (GLS), a combinatorial structure which solves the problem.
منابع مشابه
Gossip is synteny: Incomplete gossip and the syntenic distance between genomes
The syntenic distance between two genomes is given by the minimum number of fusions, fissions, and translocations required to transform one into the other, ignoring the order of genes within chromosomes. Computing this distance is NP-hard. In the present work, we give a tight connection between syntenic distance and the incomplete gossip problem, a novel generalization of the classical gossip p...
متن کاملRunning Head: Gossiping as moral action Gossiping as Moral Social Action: A Functionalist Account of Gossiper Perceptions
It appears that there are two universal dimensions of social cognition, capturing a person’s intention to be good or to do good things (i.e., morality) and his or her capacity to carry out his or her intentions (i.e., competence, or Heider’s “can”). Perceivers are strongly biased towards the former dimension, as they are more likely to seek out and act upon information concerning a person’s mor...
متن کاملLifting Redundancy from Latin Squares to Pandiagonal Latin Squares
In the pandiagonal Latin Square problem, a square grid of size N needs to be filled with N types of objects, so that each column, row, and wrapped around diagonal (both up and down) contains an object of each type. This problem dates back to at least Euler. In its specification as a constraint satisfaction problem, one uses the all different constraint. The known redundancy result about all dif...
متن کاملOn the spectrum of critical sets in latin squares of order 2
Suppose that L is a latin square of order m and P ⊆ L is a partial latin square. If L is the only latin square of order m which contains P , and no proper subset of P has this property, then P is a critical set of L. The critical set spectrum problem is to determine, for a given m, the set of integers t for which there exists a latin square of order m with a critical set of size t. We outline a...
متن کاملNecessary Conditions for the Completion of Partial Latin Squares·
A latin square is an n x n square matrix each of which cells contains a symbol chosen from the set 11,2, ... ,n]; each symbol occurs exactly oncl~ in each row or column of the matrix. A partial latin square is a latin square in which some cells are unoccupied. We consider the problem of obtaining necessary and sufficient conditions for a partial latin square to be completed to a latin square. F...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 115 شماره
صفحات -
تاریخ انتشار 2013